On Halting Process of Quantum Turing Machine
نویسندگان
چکیده
We prove that there is no algorithm to tell whether an arbitrarily constructed Quantum Turing Machine has same time steps for different branches of computation. We, hence, can not avoid the notion of halting to be probabilistic in Quantum Turing Machine. Our result suggests that halting scheme of Quantum Turing Machine and quantum complexity theory based upon the existing halting scheme sholud be reexamined.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملHalting in quantum Turing computation
The paper considers the halting scheme for quantum Turing machines. The scheme originally proposed by Deutsch appears to be correct, but not exactly as originally intended. We discuss the result of Ozawa [1] as well as the objections raised by Myers [2], Kieu and Danos [3] and others. Finally, the relationship of the halting scheme to the quest for a universal quantum Turing machine is considered.
متن کاملOn Quantum Turing Machine Halting Deterministically
We define a subclass of quantum Turing machine (QTM) named SR-QTM, which halts deterministically and has deterministic tape head position. A quantum state transition diagram (QSTD) is proposed to describe SR-QTM. With the help of QSTD, we construct a SR-QTM which is universal for all near-trivial transformations. This means there exists a QTM which is universal for the above subclass. Finally w...
متن کاملCoins, Quantum Measurements, and Turing's Barrier
Is there any hope for quantum computing to challenge the Turing barrier, i.e. to solve an undecidable problem, to compute an uncomputable function? According to Feynman’s ’82 argument, the answer is negative. This paper re-opens the case: we will discuss solutions to a few simple problems which suggest that quantum computing is theoretically capable of computing uncomputable functions. Turing p...
متن کاملQuantum Turing Machines: Local Transition, Preparation, Measurement, and Halting
The Church-Turing thesis 2 states that to be computable is to be computable by a Turing machine and the modern discipline in computational complexity theory states that to be efficiently computable is to be computable by a Turing machine within polynomial steps in the length of the input data. However, Feynman pointed out that a Turing machine cannot simulate a quantum mechanical process effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Open Syst. Inform. Dynam.
دوره 12 شماره
صفحات -
تاریخ انتشار 2005